Shadows of finite sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thin Sets with Fat Shadows: Projections of Cantor Sets

A Cantor set is a nonempty, compact, totally disconnected, perfect subset of IR. Now, the set being totally disconnected means that it is scattered about like a “dust”. If you shine light on a clump of dust floating in the air, the shadow of this dust will look like a bunch of spots on the wall. You would be very surprised if you saw that the shadow was a filled-in shape (like a rabbit, say!). ...

متن کامل

Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows

Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the boundary of S is nonsingular and has positive curvature. In this paper, we generalize their result to unbounded sets, and also study the effect of the perspective transform on singularities.

متن کامل

Finite Sets as Complements of Finite Unions of Convex Sets

Suppose S ⊆ R is a set of (finite) cardinality n whose complement can be written as the union of k convex sets. It is perhaps intuitively appealing that when n is large k must also be large. This is true, as is shown here. First the case in which the convex sets must also be open is considered, and in this case a family of examples yields an upper bound, while a simple application of a theorem ...

متن کامل

On Maximal Shadows of Members in Left-compressed Sets

Whereas Stanley, Proctor and others studied Sperner properties of the poset L(k; m) we consider shadows of left-compressed sets and derive asymptotic bounds on their sizes. ? 1999 Elsevier Science B.V. All rights reserved.

متن کامل

Induction The dance of shadows

Statistics stems out from induction. Induction is a long lasting notion in philosophy. The nature of notions in philosophy are such that neither they can be solved completely nor one can leave them forever. One of the most important problem in induction is “the problem of induction”. In this paper we give a short history of induction and discuss some aspects of the problem of induction.  

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory

سال: 1968

ISSN: 0021-9800

DOI: 10.1016/s0021-9800(68)80085-7